A Low-Complexity Double EP-Based Detector for Iterative Detection and Decoding in MIMO
نویسندگان
چکیده
We propose a new iterative detection and decoding (IDD) algorithm for multiple-input multiple-output (MIMO) based on expectation propagation (EP) with application to massive MIMO scenarios. Two main results are presented. first introduce EP iteratively improve the Gaussian approximations of both estimation posterior by detector soft output channel decoder. With this novel approach, denoted double-EP (DEP), convergence is very much improved computational complexity just two times one linear minimum mean square error (LMMSE) IDD, as illustrated included experiments. Besides, in LMMSE detector, when number antennas increases, cost matrix inversion operation required DEP becomes unaffordable. In work we also develop approaches where covariance approximated using Gauss-Seidel Neumann series methods, respectively. This low-complexity has quadratic antennas, techniques. Experimental show that achieves performance ratio between transmitting receiving decreases.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA New Low Complexity Optimal Decoding Method for MIMO Systems
A method is proposed to reduce the complexity of ML decoding for MIMO systems based on PSK constellation with two transmit antennas. We use the feature that the points of a PSK constellation form a finite group under complex multiplication to substantially reduce the decoding complexity. The proposed method of decoding is used for both BLAST systems and a new full-rate full-diversity space-time...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA Low-Complexity Stopping Criterion for Iterative Turbo Decoding
This letter proposes an efficient and simple stopping criterion for turbo decoding, which is derived by observing the behavior of log-likelihood ratio (LLR) values. Based on the behavior, the proposed criterion counts the number of absolute LLR values less than a threshold and the number of hard decision 1’s in order to complete the iterative decoding procedure. Simulation results show that the...
متن کاملLow complexity MIMO detection algorithm
The multi antenna systems offer a much larger channel capacity than the traditional single antenna systems. The price which has to be extra paid is detection complexity. In this paper we examine performance of the low complexity algorithm called zero forcing–maximum likelihood (ZFML) [5]. We find this algorithm appropriate for MIMO (Multiple Input Multiple Output) systems using more receive tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2021
ISSN: ['1558-0857', '0090-6778']
DOI: https://doi.org/10.1109/tcomm.2020.3043771